Deza digraphs
نویسندگان
چکیده
منابع مشابه
Deza digraphs
We consider a directed version of Deza graphs. A digraph is said to be a Deza digraph if it is regular and the number of common out-neighbors of any two distinct vertices takes on at most two values. We introduce some constructions and develop some basic theory. In particular, constructions from Cayley digraphs, graph lexicograph products and graph directed products are described. Moreover, we ...
متن کاملDeza digraphs II
A necessary and sufficient condition is obtained for the lexicographic (resp. categorical) product from a Deza digraph to another to be also a Deza digraph. Moreover, constructions of Deza digraphs from the incidence structures associated with vector spaces (resp. distance-regular graphs) are given.
متن کاملA directed version of Deza graphs - Deza digraphs
As a generalization of Deza graphs, we introduce Deza digraphs and describe the basic theory of these graphs. We also prove the necessary and sufficient conditions when a weakly distance-regular digraph is a Deza digraph.
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملMichel Deza , Michel Petitjean , Krassimir Markov
We study differential-geometrical structure of an information manifold equipped with a divergence function.A divergence function generates a Riemannian metric and furthermore it provides a symmetric third-order tensor,when the divergence is asymmetric. This induces a pair of affine connections dually coupled to each other withrespect to the Riemannian metric. This is the arising eme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2006
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2005.04.001